Triangulations into Groups

نویسنده

  • IGOR RIVIN
چکیده

A. If a (cusped) surface S admits an ideal triangulation T with no shears, we show an efficient algorithm to give S as a quotient of hypebolic plane H by a subgroup of PSL(2,Z). The algorithm runs in time O(n logn), where n is the number of triangles in the triangulation T . The algorithm generalizes to producing fundamental groups of general surfaces and geometric manifolds of higher dimension.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Edge--ipping Distance of Triangulations Institut F Ur Informatik | Report 76 *

An edge-ipping operation in a triangulation T of a set of points in the plane is a local restructuring that changes T into a triangulation that diiers from T in exactly one edge. The edge-ipping distance between two triangulations of the same set of points is the minimum number of edge-ipping operations needed to convert one into the other. In the context of computing the rotation distance of b...

متن کامل

New bijective links on planar maps via orientations

This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific “transversal structures” on triangulations of the 4-gon with no separating 3-cycle, which are called irreducible triangulations. This bijection specializes to a bijection between rooted non-separable maps and rooted irreducible triangulations. This yi...

متن کامل

. C O ] 3 D ec 1 99 8 A CLASSIFICATION OF CENTRALLY - SYMMETRIC AND CYCLIC 12 - VERTEX TRIANGULATIONS

In this paper our main result states that there exist exactly three combinatorially distinct centrally-symmetric 12-vertex-triangulations of the product of two 2-spheres with a cyclic symmetry. We also compute the automorphism groups of the triangulations. These instances suggest that there is a triangulation of S × S with 11 vertices – the minimum number of vertices required.

متن کامل

The Edge-flipping Distance of Triangulations

An edge-flipping operation in a triangulation T of a set of points in the plane is a local restructuring that changes T into a triangulation that differs from T in exactly one edge. The edgeflipping distance between two triangulations of the same set of points is the minimum number of edge-flipping operations needed to convert one into the other. In the context of computing the rotation distanc...

متن کامل

Triangulations and Severi Varieties

We consider the problem of constructing triangulations of projective planes over Hurwitz algebras with minimal numbers of vertices. We observe that the numbers of faces of each dimension must be equal to the dimensions of certain representations of the automorphism groups of the corresponding Severi varieties. We construct a complex involving these representations, which should be considered as...

متن کامل

The Edge- ipping Distance of Triangulations

An edgeipping operation in a triangulation T of a set of points in the plane is a local restructuring that changes T into a triangulation that di ers from T in exactly one edge. The edgeipping distance between two triangulations of the same set of points is the minimum number of edgeipping operations needed to convert one into the other. In the context of computing the rotation distance of bina...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005